CENTRALITY MEASURES ON BRINKMANN GRAPH: BEFORE AND AFTER NODE DELETION

نویسندگان

چکیده

Brinkmann graph is a 4-regular with 21 nodes and 42 edges discovered by Gunnar in 1992. To our knowledge, the research specifically on still hard to find. Therefore, this was carried out analyze term of its centrality. The centrality measures used are degree, betweenness, closeness In paper, we presented not only but also after node deletion see how impact graph. Before deletion, results showed that according betweenness centrality, there exist 7 who act as mediators or bridges when among these has deleted, it affected any other mediator furthest from deleted adjacent nodes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eigenvector-centrality - a node-centrality?

Networks of social relations can be represented by graphs and socioor adjacency-matrices and their structure can be analyzed using different concepts, one of them called centrality. We will provide a new formalization of a “node-centrality” which leads to some properties a measure of centrality has to satisfy. These properties allow to test given measures, for example measures based on degree, ...

متن کامل

A Comparison of Centrality Measures for Graph-Based Keyphrase Extraction

In this paper, we present and compare various centrality measures for graphbased keyphrase extraction. Through experiments carried out on three standard datasets of different languages and domains, we show that simple degree centrality achieve results comparable to the widely used TextRank algorithm, and that closeness centrality obtains the best results on short documents.

متن کامل

Graph Centrality Measures for Boosting Popularity-Based Entity Linking

Many Entity Linking systems use collective graph-based methods to disambiguate the entity mentions within a document. Most of them have focused on graph construction and initial weighting of the candidate entities, less attention has been devoted to compare the graph ranking algorithms. In this work, we focus on the graph-based ranking algorithms, therefore we propose to apply five centrality m...

متن کامل

On the Variance-Type Graph Irregularity Measures

Bell's degree-variance Var$!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,cdots,d_n$) and size $m$, is defined as$Var!_{B} (G)=frac{1}{n} sum _{i=1}^{n}left[d_{i} -frac{2m}{n}right]^{2}$.In this paper, a new version of the irregularity measures of variance-type, denoted by $Var_q$, is introduced and discussed. Based on a comparative study, it is demonstrated that the n...

متن کامل

A Faster Algorithm to Update Betweenness Centrality after Node Alteration

Betweenness centrality is a centrality measure that is widely used, with applications across several disciplines. It is a measure which quantifies the importance of a vertex based on its occurrence in shortest paths between all possible pairs of vertices in a graph. This is a global measure, and in order to find the betweenness centrality of a node, one is supposed to have complete information ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Barekeng

سال: 2022

ISSN: ['1978-7227', '2615-3017']

DOI: https://doi.org/10.30598/barekengvol16iss3pp1097-1104